Method of constructing merge list

ABSTRACT

Provided is a method checks availability of spatial merge candidates and a temporal merge candidate, constructs a merge candidate list using available spatial and temporal merge candidates, and adds one or more candidates if the number of available spatial and temporal merge candidates is smaller than a predetermined number. The spatial merge candidate is motion information of a spatial merge candidate block, the spatial merge candidate block is a left block, an above block, an above-right block, a left-below block or an above-left block of the current block, and if the current block is a second prediction unit partitioned by asymmetric partitioning, the spatial merge candidate corresponding to a first prediction unit partitioned by the asymmetric partitioning is set as unavailable. Therefore, the coding efficiency of motion information is improved by removing unavailable merge candidates and adding new merge candidates from the merge list.

CROSS-REFERENCES TO RELATED APPLICATIONS

The present application is a continuation of U.S. patent applicationSer. No. 14/350,013, filed Apr. 4, 2014, which is a continuation of PCTApplication No. PCT/CN2012/084240, filed Nov. 7, 2012, which claimspriority of Korean Patent Application No. 10-2011-0115219, filed Nov. 7,2011, which are incorporated by reference in their entirety.

TECHNICAL FIELD

The present invention relates to a method of constructing merge list,and more particularly, to a method of deriving spatial merge candidatesbased on a size and a partition index of a prediction unit and derivinga temporal merge candidate.

BACKGROUND ART

Methods for compressing video data include MPEG-2, MPEG-4 andH.264/MPEG-4 AVC. According to these methods, one picture is dividedinto macroblocks to encode an image, the respective macroblocks areencoded by generating a prediction block using inter prediction or intraprediction. The difference between an original block and the predictionblock is transformed to generate a transformed block, and thetransformed block is quantized using a quantization parameter and one ofa plurality of predetermined quantization matrices. The quantizedcoefficient of the quantized block are scanned by a predetermined scantype and then entropy-coded. The quantization parameter is adjusted permacroblock and encoded using a previous quantization parameter.

In H.264/MPEG-4 AVC, motion estimation is used to eliminate temporalredundancy between consecutive pictures. To detect the temporalredundancy, one or more reference pictures are used to estimate motionof a current block, and motion compensation is performed to generate aprediction block using motion information. The motion informationincludes one or more reference picture indexes and one or more motionvectors. The motion vector of the motion information is predictivelyencoded using neighboring motion vectors, and the reference pictureindexes are encoded without neighboring reference picture indexes.

However, if various sizes are used for inter prediction, the correlationbetween motion information of a current block and motion information ofone or more neighboring block increases. Also, if a motion of a currentblock is similar to or same as one of neighboring blocks, it is moreeffective to predictively encode the motion information using motioninformation of the neighboring blocks.

DISCLOSURE Technical Problem

The present invention is directed to a method of deriving spatial mergecandidates based on a size and a partition index of a prediction unitand deriving a temporal merge candidate to construct merge list.

Technical Solution

One aspect of the present invention provides a method of constructing amerge candidate list, comprising: checking availability of spatial mergecandidates, checking availability of a temporal merge candidate,constructing the merge candidate list using available spatial andtemporal merge candidates, and adding one or more candidates if thenumber of available spatial and temporal merge candidates is smallerthan a predetermined number. The spatial merge candidate is motioninformation of a spatial merge candidate block, the spatial mergecandidate block is a left block, an above block, an above-right block, aleft-below block or an above-left block of the current block, and if thecurrent block is a second prediction unit partitioned by asymmetricpartitioning, the spatial merge candidate corresponding to a firstprediction unit partitioned by the asymmetric partitioning is set asunavailable.

Advantageous Effects

A method according to the present invention checks availability ofspatial and temporal merge candidates and constructs the merge candidatelist using available spatial and temporal merge candidates, and adds oneor more candidates if the number of available spatial and temporal mergecandidates is smaller than a predetermined number. The spatial mergecandidate is motion information of a spatial merge candidate block, thespatial merge candidate block is a left block, an above block, anabove-right block, a left-below block or an above-left block of thecurrent block, and if the current block is a second prediction unitpartitioned by asymmetric partitioning, the spatial merge candidatecorresponding to a first prediction unit partitioned by the asymmetricpartitioning is set as unavailable. Also, the coding efficiency ofresidual block is improved by adaptively adjusting a quantizationparameter per a quantization unit and generating a quantizationparameter predictor using multiple neighboring quantization parameters.

DESCRIPTION OF DRAWINGS

FIG. 1 is a block diagram of an image coding apparatus according to thepresent invention.

FIG. 2 is a flow chart illustrating a procedure of encoding video dataaccording to the present invention.

FIG. 3 is a flow chart illustrating a method of encoding motioninformation in the merge mode according to the present invention.

FIG. 4 is a conceptual diagram illustrating positions of spatial mergecandidate blocks according to the present invention.

FIG. 5 is a conceptual block diagram illustrating positions of spatialmerge candidate blocks according to the present invention.

FIG. 6 is another conceptual block diagram illustrating positions ofspatial merge candidate blocks according to the present invention.

FIG. 7 is another conceptual block diagram illustrating positions ofspatial merge candidate blocks according to the present invention.

FIG. 8 is another conceptual block diagram illustrating positions ofspatial merge candidate blocks according to the present invention.

FIG. 9 is a conceptual diagram illustrating position of temporal mergecandidate block according to the present invention.

FIG. 10 is a block diagram of an image decoding apparatus according tothe present invention.

FIG. 11 is a flow chart illustrating a method of decoding an image ininter prediction mode according to the present invention.

FIG. 12 is a flow chart illustrating a method of deriving motioninformation in merge mode.

FIG. 13 is a flow chart illustrating a procedure of generating aresidual block in inter prediction mode according to the presentinvention.

FIG. 14 is a flow chart illustrating a method of deriving a quantizationparameter according to the present invention.

MODE FOR INVENTION

Hereinafter, various embodiments of the present invention will bedescribed in detail with reference to the accompanying drawings.However, the present invention is not limited to the exemplaryembodiments disclosed below, but can be implemented in various types.Therefore, many other modifications and variations of the presentinvention are possible, and it is to be understood that within the scopeof the disclosed concept, the present invention may be practicedotherwise than as has been specifically described.

An image encoding apparatus and an image decoding apparatus according tothe present invention may be a user terminal such as a personalcomputer, a personal mobile terminal, a mobile multimedia player, asmartphone or a wireless communication terminal The image encodingdevice and the image decoding device may be include a communication unitfor communicating with various devices, a memory for storing variousprograms and data used to encode or decode images.

FIG. 1 is a block diagram of an image coding apparatus 100 according tothe present invention.

Referring to FIG. 1, the image coding apparatus 100 according to thepresent invention includes a picture division unit 110, an intraprediction unit 120, an inter prediction unit 130, a transform unit 140,a quantization unit 150, a scanning unit 160, an entropy coding unit170, an inverse quantization/transform unit 180, a post-processing unit190 and a picture storing unit 195.

The picture division unit 110 divides a picture or a slice into aplurality of largest coding units (LCUs), and divides each LCU into oneor more coding units. The size of LCU may be 32×32, 64×64 or 128×128.The picture division unit 110 determines prediction mode andpartitioning mode of each coding unit.

An LCU includes one or more coding units. The LCU has a recursive quadtree structure to specify a division structure of the LCU. Parametersfor specifying the maximum size and the minimum size of the coding unitare included in a sequence parameter set. The division structure isspecified by one or more split coding unit flags (split_cu_flags). Thesize of a coding unit is 2N×2N. If the size of the LCU is 64×64 and thesize of a smallest coding unit (SCU) is 8×8, the size of the coding unitmay be 64×64, 32×32, 16×16 or 8×8.

A coding unit includes one or more prediction units. In intraprediction, the size of the prediction unit is 2N×2N or N×N. In interprediction, the size of the prediction unit is specified by thepartitioning mode. The partitioning mode is one of 2N×2N, 2N×N, N×2N andNxN if the coding unit is partitioned symmetrically. The partitioningmode is one of 2N×nU, 2N×nD, nL×2N and nR×2N if the coding unit ispartitioned asymmetrically. The partitioning modes are allowed based onthe size of the coding unit to reduce complexity of hardware. If thecoding unit has a minimum size, the asymmetric partitioning may not beallowed. Also, if the coding unit has the minimum size, NxN partitioningmode may not be allowed.

A coding unit includes one or more transform units. The transform unithas a recursive quad tree structure to specify a division structure ofthe coding unit. The division structure is specified by one or moresplit transform unit flags (split_tu_flags). Parameters for specifyingthe maximum size and the minimum size of the luma transform unit areincluded in a sequence parameter set.

The intra prediction unit 120 determines an intra prediction mode of acurrent prediction unit and generates a prediction block using the intraprediction mode.

The inter prediction unit 130 determines motion information of a currentprediction unit using one or more reference pictures stored in thepicture storing unit 195, and generates a prediction block of theprediction unit. The motion information includes one or more referencepicture indexes and one or more motion vectors.

The transform unit 140 transforms a residual block to generate atransformed block. The residual block has the same size of the transformunit. If the prediction unit is larger than the transform unit, theresidual signals between the current block and the prediction block arepartitioned into multiple residual blocks.

The quantization unit 150 determines a quantization parameter forquantizing the transformed block. The quantization parameter is aquantization step size. The quantization parameter is determined perquantization unit. The size of the quantization unit may vary and be oneof allowable sizes of coding unit. If a size of the coding unit is equalto or larger than the minimum size of the quantization unit, the codingunit becomes the quantization unit. A plurality of coding units may beincluded in a quantization unit of minimum size. The minimum size of thequantization unit is determined per picture and a parameter forspecifying the minimum size of the quantization unit is included in apicture parameter set.

The quantization unit 150 generates a quantization parameter predictorand generates a differential quantization parameter by subtracting thequantization parameter predictor from the quantization parameter. Thedifferential quantization parameter is entropy-coded.

The quantization parameter predictor is generated by using quantizationparameters of neighboring coding units and a quantization parameter ofprevious coding unit as follows.

A left quantization parameter, an above quantization parameter and aprevious quantization parameter are sequentially retrieved in thisorder. An average of the first two available quantization parametersretrieved in that order is set as the quantization parameter predictorwhen two or more quantization parameters are available, and when onlyone quantization parameter is available, the available quantizationparameter is set as the quantization parameter predictor. That is, ifthe left and above quantization parameters are available, an average ofthe left and above quantization parameters is set as the quantizationparameter predictor. If only one of the left and above quantizationparameters is available, an average of the available quantizationparameter and the previous quantization parameters is set as thequantization parameter predictor. If both of the left and abovequantization parameters are unavailable, the previous quantizationparameter is set as the quantization parameter predictor. The average isrounded off.

The differential quantization parameter is converted into bins for theabsolute value of the differential quantization parameter and a bin forindicating sign of the differential quantization parameter through abinarization process, and the bins are arithmetically coded. If theabsolute value of the differential quantization parameter is 0, the binfor indicating sign may be omitted. Truncated unary is used forbinarization of the absolute.

The quantization unit 150 quantizes the transformed block using aquantization matrix and the quantization parameter to generate aquantized block. The quantized block is provided to the inversequantization/transform unit 180 and the scanning unit 160.

The scanning unit 160 determines applies a scan pattern to the quantizedblock.

In inter prediction, a diagonal scan is used as the scan pattern ifCABAC is used for entropy coding. The quantized coefficients of thequantized block are split into coefficient components. The coefficientcomponents are significant flags, coefficient signs and coefficientlevels. The diagonal scan is applied to each of the coefficientcomponents. The significant coefficient indicates whether thecorresponding quantized coefficient is zero or not. The coefficient signindicates a sign of non-zero quantized coefficient, and the coefficientlevel indicates an absolute value of non-zero quantized coefficient.

When the size of the transform unit is larger than a predetermined size,the quantized block is divided into multiple subsets and the diagonalscan is applied to each subset. Significant flags, coefficient signs andcoefficients levels of each subset are scanned respectively according tothe diagonal scan. The predetermined size is 4×4. The subset is a 4×4block containing 16 transform coefficients. The scan pattern forscanning the subsets is the same as the scan pattern for scanning thecoefficient components. The significant flags, the coefficient signs andthe coefficients levels of each subset are scanned in the reversedirection. The subsets are also scanned in the reverse direction.

A parameter indicating last non-zero coefficient position is encoded andtransmitted to a decoding side. The parameter indicating last non-zerocoefficient position specifies a position of last non-zero quantizedcoefficient within the quantized block. A non-zero subset flag isdefined for each subset other than the first subset and the last subsetand is transmitted to the decoding side. The first subset covers a DCcoefficient. The last subset covers the last non-zero coefficient. Thenon-zero subset flag indicates whether the subset contains non-zerocoefficients or not.

The entropy coding unit 170 entropy-codes the scanned component by thescanning unit 160, intra prediction information received from the intraprediction unit 120, motion information received from the interprediction unit 130, and so on.

The inverse quantization/transform unit 180 inversely quantizes thequantized coefficients of the quantized block, and inversely transformsthe inverse quantized block to generate residual block.

The post-processing unit 190 performs a deblocking filtering process forremoving blocking artifact generated in a reconstructed picture.

The picture storing unit 195 receives post-processed image from thepost-processing unit 190, and stores the image in picture units. Apicture may be a frame or a field.

FIG. 2 is a flow chart illustrating a method of encoding video data inan inter prediction mode according to the present invention.

Motion information of a current block is determined (S110). The currentblock is a prediction unit. A size of the current block is determined bya size and a partitioning mode of the coding unit.

The motion information varies according to a prediction type. If theprediction type is a uni-directional prediction, the motion informationincludes a reference index specifying a picture of a reference list 0,and a motion vector. If the prediction type is a bi-directionalprediction, the motion information includes two reference indexesspecifying a picture of a reference list 0 and a picture of a referencelist 1, and a list 0 motion vector and a list 1 motion vector.

A prediction block of the current block is generated using the motioninformation (S120). If the motion vector indicates a pixel position, theprediction block is generated by copying a block of the referencepicture specified by the motion vector. If the motion vector indicates asub-pixel position, the prediction block is generated by interpolatingthe pixels of the reference picture.

A residual block is generated using the current block and the predictionblock (S130). The residual block has the same size of the transformunit. If the prediction unit is larger than the transform unit, theresidual signals between the current block and the prediction block areinto multiple residual blocks.

The residual block is encoded (S140). The residual block is encoded bythe transform unit 140, the quantization unit 150, the scanning unit 160and the entropy coding unit 170 of FIG. 1.

The motion information is encoded (S150). The motion information may beencoded predictively using spatial candidates and a temporal candidateof the current block. The motion information is encoded in a skip mode,a merge mode or an AMVP mode. In the skip mode, the prediction unit hasthe size of coding unit and the motion information is encoded using thesame method as that of the merge mode. In the merge mode, the motioninformation of the current prediction unit is equal to motioninformation of one candidate. In the AMVP mode, the motion vector of themotion information is predictively coded using one or more motion vectorcandidate.

FIG. 3 is a flow chart illustrating a method of encoding motioninformation in the merge mode according to the present invention.

Spatial merge candidates are derived (S210). FIG. 4 is a conceptualdiagram illustrating positions of spatial merge candidate blocksaccording to the present invention.

As shown in FIG. 4, the merge candidate block is a left block (block A),an above block (block B), an above-right block (block C), a left-belowblock (block D) or an above-left block (block E) of the current block.The blocks are prediction blocks. The above-left block (block E) is setas merge candidate block when one or more of the blocks A, B, C and Dare unavailable. The motion information of an available merge candidateblock N is set as a spatial merge candidate N. N is A, B, C, D or E.

The spatial merge candidate may be set as unavailable according to theshape of the current block and the position of the current block. Forexample, if the coding unit is split into two prediction units (block P0and block P1) using asymmetric partitioning, it is probable that themotion information of the block P0 is not equal to the motioninformation of the block P1. Therefore, if the current block is theasymmetric block P1, the block P0 is set as unavailable candidate blockas shown in FIGS. 5 to 8.

FIG. 5 is a conceptual block diagram illustrating positions of spatialmerge candidate blocks according to the present invention.

As shown in FIG. 5, a coding unit is partitioned into two asymmetricprediction blocks P0 and P1 and the partitioning mode is an nL×2N mode.The size of the block P0 is hN×2N and the size of the block P1 is(2−h)N'2N. The value of h is ½. The current block is the block P1. Theblocks A, B, C, D and E are spatial merge candidate blocks. The block P0is the spatial merge candidate block A.

In present invention, the spatial merge candidate A is set asunavailable not to be listed on the merge candidate list. Also, thespatial merge candidate block B, C, D or E having the same motioninformation of the spatial merge candidate block A is set asunavailable.

FIG. 6 is another conceptual block diagram illustrating positions ofspatial merge candidate blocks according to the present invention.

As shown in FIG. 6, a coding unit is partitioned into two asymmetricprediction blocks P0 and P1 and the partitioning mode is an nR×2N mode.The size of the block P0 is (2−h)N×2N and the size of the block P1 ishN×2N. The value of h is ½. The current block is the block P1. Theblocks A, B, C, D and E are spatial merge candidate blocks. The block P0is the spatial merge candidate block A.

In present invention, the spatial merge candidate A is set asunavailable not to be listed on the merge candidate list. Also, thespatial merge candidate block B, C, D or E having the same motioninformation of the spatial merge candidate block A is set asunavailable.

FIG. 7 is another conceptual block diagram illustrating positions ofspatial merge candidate blocks according to the present invention.

As shown in FIG. 7, a coding unit is partitioned into two asymmetricprediction blocks P0 and P1 and the partitioning mode is a 2N×nU mode.The size of the block P0 is 2N×hN and the size of the block P1 is2N×(2−h)N. The value of h is ½. The current block is the block P1. Theblocks A, B, C, D and E are spatial merge candidate blocks. The block P0is the spatial merge candidate block B.

In present invention, the spatial merge candidate B is set asunavailable not to be listed on the merge candidate list. Also, thespatial merge candidate block C, D or E having the same motioninformation of the spatial merge candidate block B is set asunavailable.

FIG. 8 is another conceptual block diagram illustrating positions ofspatial merge candidate blocks according to the present invention.

As shown in FIG. 8, a coding unit is partitioned into two asymmetricprediction blocks P0 and P1 and the partitioning mode is a 2N×nD mode.The size of the block P0 is 2N×(2−h)N and the size of the block P1 is2N×hN. The value of h is ½. The current block is the block P1. Theblocks A, B, C, D and E are spatial merge candidate blocks. The block P0is the spatial merge candidate block B.

In present invention, the spatial merge candidate B is set asunavailable not to be listed on the merge candidate list. Also, thespatial merge candidate block C, D or E having the same motioninformation of the spatial merge candidate block B is set asunavailable.

The spatial merge candidate may also be set as unavailable based onmerge area. If the current block and the spatial merge candidate blockbelong to same merge area, the spatial merge candidate block is set asunavailable. The merge area is a unit area in which motion estimation isperformed and information specifying the merge area is included in a bitstream.

A temporal merge candidate is derived (S220). The temporal mergecandidate includes a reference picture index and a motion vector of thetemporal merge candidate.

The reference picture index of the temporal merge candidate may bederived using one or more reference picture indexes of neighboringblock. For example, one of the reference picture indexes of a leftneighboring block, an above neighboring block and a corner neighboringblock is set as the reference picture index of the temporal mergecandidate. The corner neighboring block is one of an above-rightneighboring block, a left-below neighboring block and an above-leftneighboring block. Alternatively, the reference picture index of thetemporal merge candidate may be set to zero to reduce the complexity.

The motion vector of the temporal merge candidate may be derived asfollows.

First, a temporal merge candidate picture is determined The temporalmerge candidate picture includes a temporal merge candidate block. Onetemporal merge candidate picture is used within a slice. A referencepicture index of the temporal merge candidate picture may be set tozero.

If the current slice is a P slice, one of the reference pictures of thereference picture list 0 is set as the temporal merge candidate picture.If the current slice is a B slice, one of the reference pictures of thereference picture lists 0 and 1 is set as the temporal merge candidatepicture. A list indicator specifying whether the temporal mergecandidate picture belongs to the reference picture lists 0 or 1 isincluded in a slice header if the current slice is a B slice. Thereference picture index specifying the temporal merge candidate picturemay be included in the slice header.

Next, the temporal merge candidate block is determined The temporalmerge candidate block may be a first candidate block or a secondcandidate block. If the first candidate block is available, the firstcandidate block is set as the temporal merge candidate block. If thefirst candidate block is unavailable, the second candidate block is setas the temporal merge candidate block. If the second candidate block isunavailable, the temporal merge candidate block is set as unavailable.

FIG. 9 is a conceptual diagram illustrating position of temporal mergecandidate block according to the present invention. As shown in FIG. 9,the first merge candidate block may be a right-below corner block (blockH) of the block C. The block C has same size and same location of thecurrent block and is located within the temporal merge candidatepicture. The second merge candidate block is a block covering anupper-left pixel of the center of the block C.

If the temporal merge candidate block is determined, the motion vectorof the temporal merge candidate block is set as the motion vector of thetemporal merge candidate.

A merge candidate list is constructed (S230). The available spatialcandidates and the available temporal candidate are listed in apredetermined order. The spatial merge candidates are listed up to fourin the order of A, B, C, D and E. The temporal merge candidate may belisted between B and C or after the spatial candidates.

It is determined whether one or more merge candidates are generated ornot (S240). The determination is performed by comparing the number ofmerge candidates listed in the merge candidate list with a predeterminednumber of the merge candidates. The predetermined number may bedetermined per picture or slice.

If the number of merge candidates listed in the merge candidate list issmaller than a predetermined number of the merge candidates, one or moremerge candidates are generated (S250). The generated merge candidate islisted after the last available merge candidate.

If the number of available merge candidates is equal to or greater than2, one of two available merge candidates has list 0 motion informationand the other has list 1 motion information, the merge candidate may begenerated by combining the list 0 motion information and the list 1motion information. Multiple merge candidates may be generated if thereare multiple combinations.

One or more zero merge candidates may be added to the list. If the slicetype is P, the zero merge candidate has only list 0 motion information.If the slice type is B, the zero merge candidate has list 0 motioninformation and list 1 motion information.

A merge predictor is selected among the merge candidates of the mergelist, a merge index specifying the merge predictor is encoded (S260).

FIG. 10 is a block diagram of an image decoding apparatus 200 accordingto the present invention.

The image decoding apparatus 200 according to the present inventionincludes an entropy decoding unit 210, an inverse scanning unit 220, aninverse quantization unit 230, an inverse transform unit 240, an intraprediction unit 250, an inter prediction unit 260, a post-processingunit 270, a picture storing unit 280 and an adder 290.

The entropy decoding unit 210 extracts the intra prediction information,the inter prediction information and the quantized coefficientcomponents from a received bit stream using a context-adaptive binaryarithmetic decoding method.

The inverse scanning unit 220 applies an inverse scan pattern to thequantized coefficient components to generate quantized block. In interprediction, the inverse scan pattern is a diagonal scan. The quantizedcoefficient components include the significant flags, the coefficientsigns and the coefficients levels.

When the size of the transform unit is larger than the a predeterminedsize, the significant flags, the coefficient signs and the coefficientslevels are inversely scanned in the unit of subset using the diagonalscan to generate subsets, and the subsets are inversely scanned usingthe diagonal scan to generate the quantized block. The predeterminedsize is equal to the size of the subset. The subset is a 4×4 blockincluding 16 transform coefficients. The significant flags, thecoefficient signs and the coefficient levels are inversely scanned inthe reverse direction. The subsets are also inversely scanned in thereverse direction.

A parameter indicating last non-zero coefficient position and thenon-zero subset flags are extracted from the bit stream. The number ofencoded subsets is determined based on the last non-zero coefficientposition. The non-zero subset flag is used to determine whether thecorrenponding subset has at least one non-zero coefficient. If thenon-zero subset flag is equal to 1, the subset is generated using thediagonal scan. The first subset and the last subset are generated usingthe inverse scan pattern.

The inverse quantization unit 230 receives the differential quantizationparameter from the entropy decoding unit 210 and generates thequantization parameter predictor to generate the quantization parameterof the coding unit. The operation of generating the quantizationparameter predictor is the same as the operation of the quantizationunit 150 of FIG. 1. Then, the quantization parameter of the currentcoding unit is generated by adding the differential quantizationparameter and the quantization parameter predictor. If the differentialquantization parameter is not transmitted from an encoding side, thedifferential quantization parameter is set to zero.

The inverse quantization unit 230 inversely quantizes the quantizedblock.

The inverse transform unit 240 inversely transforms theinverse-quantized block to generate a residual block. An inversetransform matrix is adaptively determined according to the predictionmode and the size of the transform unit. The inverse transform matrix isa DCT-based integer transform matrix or a DST-based integer transformmatrix. In inter prediction, the DCT-based integer transforms are used.

The intra prediction unit 250 derives an intra prediction mode of acurrent prediction unit using the received intra prediction information,and generates a prediction block according to the derived intraprediction mode.

The inter prediction unit 260 derives the motion information of thecurrent prediction unit using the received inter prediction information,and generates a prediction block using the motion information.

The post-processing unit 270 operates the same as the post-processingunit 180 of FIG. 1.

The picture storing unit 280 receives post-processed image from thepost-processing unit 270, and stores the image in picture units. Apicture may be a frame or a field.

The adder 290 adds the restored residual block and a prediction block togenerate a reconstructed block.

FIG. 11 is a flow chart illustrating a method of decoding an image ininter prediction mode according to the present invention.

Motion information of a current block is derived (S310). The currentblock is a prediction unit. A size of the current block is determined bythe size of the coding unit and the partitioning mode.

The motion information varies according to a prediction type. If theprediction type is a uni-directional prediction, the motion informationincludes a reference index specifying a picture of a reference list 0,and a motion vector. If the prediction type is a bi-directionalprediction, the motion information includes a reference index specifyinga picture of a reference list 0, a reference index specifying a pictureof a reference list 1, and a list 0 motion vector and a list 1 motionvector.

The motion information is adaptively decoded according the coding modeof the motion information. The coding mode of the motion information isdetermined by a skip flag and a merge flag. If the skip flag is equal to1, the merge flag does not exist and the coding mode is a skip mode. Ifthe skip flag is equal to 0 and the merge flag is equal to 1, the codingmode is a merge mode. If the skip flag and the merge flag are equal to0, the coding mode is an AMVP mode.

A prediction block of the current block is generated using the motioninformation (S320).

If the motion vector indicates a pixel position, the prediction block isgenerated by copying a block of the reference picture specified by themotion vector. If the motion vector indicates a sub-pixel position, theprediction block is generated by interpolating the pixels of thereference picture.

A residual block is generated (S330). The residual block is generated bythe entropy decoding unit 210, the inverse scanning unit 220, theinverse quantization unit 230 and the inverse transform unit 240 of FIG.10.

A reconstructed block is generated using the prediction block and theresidual block (S340).

The prediction block has the same size of the prediction unit, and theresidual block has the same size of the transform unit. Therefore, theresidual signals and the prediction signals of same size are added togenerate reconstructed signals.

FIG. 12 is a flow chart illustrating a method of deriving motioninformation in merge mode.

A merge index is extracted from a bit stream (S410). If the merge indexdoes not exist, the number of merge candidates is set to one.

Spatial merge candidates are derived (S420). The available spatial mergecandidates are the same as describe in S210 of FIG. 3.

A temporal merge candidate is derived (S430). The temporal mergecandidate includes a reference picture index and a motion vector of thetemporal merge candidate. The reference index and the motion vector ofthe temporal merge candidate are the same as described in S220 of FIG.3.

A merge candidate list is constructed (S440). The merge list is the sameas described in S230 of FIG. 3.

It is determined whether one or more merge candidates are generated ornot (S450). The determination is performed by comparing the number ofmerge candidates listed in the merge candidate list with a predeterminednumber of the merge candidates. The predetermined number is determinedper picture or slice.

If the number of merge candidates listed in the merge candidate list issmaller than a predetermined number of the merge candidates, one or moremerge candidates are generated (S460). The generated merge candidate islisted after the last available merge candidate. The merge candidate isgenerated as the same method described in S250 of FIG. 3.

The merge candidate specified by the merge index is set as the motioninformation of the current block (S470).

FIG. 13 is a flow chart illustrating a procedure of generating aresidual block in inter prediction mode according to the presentinvention.

Quantized coefficient components are generated by the entropy decodingunit (S510).

A quantized block is generated by inversely scanning the quantizedcoefficient components according to the diagonal scan (S520). Thequantized coefficient components include the significant flags, thecoefficient signs and the coefficients levels.

When the size of the transform unit is larger than a predetermined size,the significant flags, the coefficient signs and the coefficients levelsare inversely scanned in the unit of subset using the diagonal scan togenerate subsets, and the subsets are inversely scanned using thediagonal scan to generate the quantized block. The predetermined size isequal to the size of the subset. The subset is a 4×4 block including 16transform coefficients. The significant flags, the coefficient signs andthe coefficient levels are inversely scanned in the reverse direction.The subsets are also inversely scanned in the reverse direction.

The parameter indicating last non-zero coefficient position and thenon-zero subset flags are extracted from the bit stream. The number ofencoded subsets is determined based on the last non-zero coefficientposition. The non-zero subset flag is used to determine whether thecorrenponding subset has at least one non-zero coefficient. If thenon-zero subset flag is equal to 1, the subset is generated using thediagonal scan. The first subset and the last subset are generated usingthe inverse scan pattern.

The quantized block is inversely quantized using an inverse quantizationmatrix and a quantization parameter (S530).

FIG. 14 is a flow chart illustrating a method of deriving a quantizationparameter according to the present invention.

A minimum size of quantization unit is determined (S531). A parametercu_qp_delta_enabled_info specifying the minimum size is extracted from abit stream, and the minimum size of the quantization unit is determinedby the following equation.

Log2(MinQUSize)=Log2(MaxCUSize)−cu_qp_delta_enabled_info

The MinQUSize indicates the minimum size of the quantization unit, theMaxCUSize indicates the size of LCU. The parametercu_qp_delta_enabled_info is extracted from a picture parameter set.

A differential quantization parameter of the current coding unit isderived (S532). The differential quantization parameter is included perquantization unit. Therefore, if the size of the current coding unit isequal to or larger than the minimum size, the differential quantizationparameter for the current coding unit is restored. If the differentialquantization parameter does not exist, the differential quantizationparameter is set to zero. If multiple coding units belong to aquantization unit, the first coding unit containing at least onenon-zero coefficient in the decoding order contains the differentialquantization unit.

A coded differential quantization parameter is arithmetically decoded togenerate bin string indicating the absolute value of the differentialquantization parameter and a bin indicating the sign of the differentialquantization parameter. The bin string may be a truncated unary code. Ifthe absolute value of the differential quantization parameter is zero,the bin indicating the sign does not exist. The differentialquantization parameter is derived using the bin string indicating theabsolute value and the bin indicating the sign.

A quantization parameter predictor of the current coding unit is derived(S533). The quantization parameter predictor is generated by usingquantization parameters of neighboring coding units and quantizationparameter of previous coding unit as follows.

A left quantization parameter, an above quantization parameter and aprevious quantization parameter are sequentially retrieved in thisorder. An average of the first two available quantization parametersretrieved in that order is set as the quantization parameter predictorwhen two or more quantization parameters are available, and when onlyone quantization parameter is available, the available quantizationparameter is set as the quantization parameter predictor. That is, ifthe left and above quantization parameter are available, the average ofthe left and above quantization parameter is set as the quantizationparameter predictor. If only one of the left and above quantizationparameter is available, the average of the available quantizationparameter and the previous quantization parameter is set as thequantization parameter predictor. If both of the left and abovequantization parameter are unavailable, the previous quantizationparameter is set as the quantization parameter predictor.

If multiple coding units belong to a quantization unit of minimum size,the quantization parameter predictor for the first coding unit indecoding order is derived and used for the other coding units.

The quantization parameter of the current coding unit is generated usingthe differential quantization parameter and the quantization parameterpredictor (S534).

A residual block is generated by inverse-transforming theinverse-quantized block (S540). One dimensional horizontal and verticalinverse DCT based-transforms are used.

While the invention has been shown and described with reference tocertain exemplary embodiments thereof, it will be understood by thoseskilled in the art that various changes in form and details may be madetherein without departing from the spirit and scope of the invention asdefined by the appended claims.

1. An image decoding method comprising: generating a merge candidatelist using available spatial and temporal merge candidates; obtainingmotion information using a merge index and the merge candidate list;generating a prediction block using the motion information;inverse-quantizing a quantized block using a quantization parameter togenerate a transform block; inverse-transforming the transform block togenerate a residual block; and generating a reconstructed block usingthe prediction block and the residual block, wherein if a currentprediction unit is a second prediction unit partitioned by asymmetricpartitioning, the spatial merge candidate corresponding to a firstprediction unit partitioned by the asymmetric partitioning is set asunavailable, and wherein the quantization parameter is generated using aquantization parameter predictor and a differential quantizationparameter, and the quantization parameter predictor is generated byaveraging two quantization parameters of a left quantization parameter,an above quantization parameter and a previous quantization parameter iftwo or more quantization parameters are available.
 2. The method ofclaim 1, wherein if the size of the current prediction unit is(3/2)N×2N, the left spatial merge candidate are set as unavailable. 3.The method of claim 2, wherein the left spatial merge candidate ismotion information of the left prediction unit of the current predictionunit.
 4. The method of claim 2, wherein if an above spatial mergecandidate has the same motion information of the left spatial mergecandidate, the above spatial merge candidate is set as unavailable. 5.The method of claim 1, wherein the size of the current prediction unitis determined based on a partitioning mode and a size of the codingunit.
 6. The method of claim 1, if a current coding unit has an allowedminimum size, the asymmetric partitioning is not allowed.
 7. The methodof claim 1, wherein the information of the above-left block is set asthe merge candidate block if the current prediction unit is a secondprediction unit partitioned by asymmetric partitioning.
 8. The method ofclaim 1, wherein a motion vector of the temporal merge candidate is amotion vector of a temporal merge candidate block within a temporalmerge candidate picture, and a position of the temporal merge candidateblock is determined depending on a position of the current predictionunit within an LCU.
 9. The method of claim 8, wherein a referencepicture index of the temporal merge candidate is
 0. 10. The method ofclaim 1, wherein if only one of the left quantization parameter and theabove quantization parameter is available, an average of the availablequantization parameter and the previous quantization parameter is set asthe quantization parameter predictor.